A Scaled Stochastic Newton Algorithm for Markov Chain Monte Carlo Simulations
نویسنده
چکیده
We propose a scaled stochastic Newton algorithm (sSN) for local Metropolis-Hastings Markov chain Monte Carlo (MCMC) simulations. The method can be considered as an EulerMaruyama discretization of the Langevin diffusion on a Riemann manifold with piecewise constant Hessian of the negative logarithm of the target density as the metric tensor. The sSN proposal consists of deterministic and stochastic parts. The former corresponds to a Newton step that attempts to move the current state to a region of higher probability, hence potentially increasing the acceptance probability. The latter is distributed by a Gaussian tailored to the local Hessian as the inverse covariance matrix. The proposal step is then corrected by the standard Metropolization to guarantee that the target density is the stationary distribution. We study asymptotic convergence and geometric ergodicity of sSN chains. At the heart of the paper is the optimal scaling analysis, in which we show that, for inhomogeneous product target distribution at stationarity, the sSN proposal variance scales like O ( n−1/3 ) for the average acceptance rate to be bounded away from zero, as the dimension n approaches infinity. As a result, a sSN chain explores the stationary distribution in O ( n1/3 ) steps, regardless of the variance of the target density. The optimal scaling behavior of sSN chains in the transient phase is also discussed for Gaussian target densities, and an extension to inverse problems using the Bayesian formulation is presented. The theoretical optimal scaling result is verified for two i.i.d. targets in high dimensions. We also compare the sSN approach with other similar Hessianaware methods on i.i.d. targets, Bayesian logistic regression, and log-Gaussian Cox process examples. Numerical results show that sSN outperforms the others by providing Markov chains with small burnin and small correlation length. Finally, we apply the sSN method to a Bayesian inverse thermal fin problem to predict the posterior mean and its uncertainty.
منابع مشابه
A Stochastic algorithm to solve multiple dimensional Fredholm integral equations of the second kind
In the present work, a new stochastic algorithm is proposed to solve multiple dimensional Fredholm integral equations of the second kind. The solution of the integral equation is described by the Neumann series expansion. Each term of this expansion can be considered as an expectation which is approximated by a continuous Markov chain Monte Carlo method. An algorithm is proposed to sim...
متن کاملStochastic Newton Sampler: The R Package sns
The R package sns implements Stochastic Newton Sampler (SNS), a Metropolis-Hastings Monte Carlo Markov Chain algorithm where the proposal density function is a multivariate Gaussian based on a local, second-order Taylor-series expansion of log-density. The mean of the proposal function is the full Newton step in Newton-Raphson optimization algorithm. Taking advantage of the local, multivariate ...
متن کاملImproving Samc Using Smoothing Methods : Theory and Applications to Bayesian Model
Stochastic approximation Monte Carlo (SAMC) has recently been proposed by Liang, Liu and Carroll [J. Amer. Statist. Assoc. 102 (2007) 305–320] as a general simulation and optimization algorithm. In this paper, we propose to improve its convergence using smoothing methods and discuss the application of the new algorithm to Bayesian model selection problems. The new algorithm is tested through a ...
متن کاملBayesian inference by simulation in a stochastic model from hematology
A particular Markov chain Monte Carlo algorithmis constructed to allow Bayesian inference in a hidden Markov model used in hematology. The algorithm has an outer Gibbsian structure, and incorporates both Metropolis and Hastings updates to move through the space of possible hidden states. While somewhat sophisticated, this algorithm still has problems getting around the infinite-dimensional spac...
متن کاملImproving SAMC Using Smoothing Methods: Theory and Applications to Bayesian Model Selection Problems
Stochastic approximation Monte Carlo (SAMC) has recently been proposed by Liang, Liu and Carroll (2007) as a general simulation and optimization algorithm. In this paper, we propose to improve its convergence using smoothing methods and discuss the application of the new algorithm to Bayesian model selection problems. The new algorithm is tested through a change-point identification example. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012